منابع مشابه
Average Case Completeness
We explain and advance Levin’s theory of average case completeness. In particular, we exhibit examples of problems complete in the average case and prove a limitation on the power of deterministic reductions. ∗J. Computer and System Sciences 42:3, June 1991, 346–398. †Partially supported by NSF grant DCR 85-03275.
متن کاملGeneric case completeness
In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete.
متن کاملAverage-case interactive communication
X and Y are random variables. Person P X knows X , Person P Y knows Y , and both know the joint probability distribution of the pair (X; Y). Using a predetermined protocol, they communicate over a binary, error-free, channel in order for P Y to learn X. P X may or may not learn Y. How many information bits must be transmitted (by both persons) on the average? At least H (XjY) bits must be trans...
متن کاملAverage Case Complexity, Revisited
More than two decades elapsed since Levin set forth a theory of average-case complexity. In this survey we present the basic aspects of this theory as well as some of the main results regarding it. The current presentation deviates from our old “Notes on Levin’s Theory of Average-Case Complexity” (ECCC, TR97-058, 1997) in several aspects.
متن کاملAverage-Case "messy" Broadcasting
Current studies of “messy” broadcasting have so far concentrated on finding worst-case times. However, such worst-case scenarios are extremely unlikely to occur in general. Hence, determining average-case times or tight upper bounds for completing “messy” broadcasting in various network topologies is both necessary and meaningful in practice. In this paper, we focus on seeking the average-case ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1991
ISSN: 0022-0000
DOI: 10.1016/0022-0000(91)90007-r